TSTP Solution File: NUM640^1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : NUM640^1 : TPTP v8.1.0. Released v3.7.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 11:53:33 EDT 2022
% Result : Theorem 0.12s 0.36s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 18 ( 13 unt; 5 typ; 0 def)
% Number of atoms : 33 ( 21 equ; 0 cnn)
% Maximal formula atoms : 1 ( 2 avg)
% Number of connectives : 68 ( 2 ~; 0 |; 0 &; 66 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 1 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 4 con; 0-2 aty)
% Number of variables : 10 ( 0 ^ 10 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_nat,type,
nat: $tType ).
thf(tp_pl,type,
pl: nat > nat > nat ).
thf(tp_suc,type,
suc: nat > nat ).
thf(tp_x,type,
x: nat ).
thf(tp_y,type,
y: nat ).
thf(1,axiom,
! [Xx: nat,Xy: nat] :
( ( pl @ Xx @ ( suc @ Xy ) )
= ( suc @ ( pl @ Xx @ Xy ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz4b) ).
thf(2,conjecture,
( ( suc @ ( pl @ x @ y ) )
= ( pl @ x @ ( suc @ y ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz4f) ).
thf(3,negated_conjecture,
( ( ( suc @ ( pl @ x @ y ) )
= ( pl @ x @ ( suc @ y ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[2]) ).
thf(4,plain,
( ( ( suc @ ( pl @ x @ y ) )
= ( pl @ x @ ( suc @ y ) ) )
= $false ),
inference(unfold_def,[status(thm)],[3]) ).
thf(5,plain,
( ( ! [Xx: nat,Xy: nat] :
( ( pl @ Xx @ ( suc @ Xy ) )
= ( suc @ ( pl @ Xx @ Xy ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(6,plain,
( ( ( ( suc @ ( pl @ x @ y ) )
!= ( pl @ x @ ( suc @ y ) ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[4]) ).
thf(7,plain,
( ( ! [Xx: nat,Xy: nat] :
( ( pl @ Xx @ ( suc @ Xy ) )
= ( suc @ ( pl @ Xx @ Xy ) ) ) )
= $true ),
inference(copy,[status(thm)],[5]) ).
thf(8,plain,
( ( ( ( suc @ ( pl @ x @ y ) )
!= ( pl @ x @ ( suc @ y ) ) ) )
= $true ),
inference(copy,[status(thm)],[6]) ).
thf(9,plain,
! [SV1: nat] :
( ( ! [SY2: nat] :
( ( pl @ SV1 @ ( suc @ SY2 ) )
= ( suc @ ( pl @ SV1 @ SY2 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[7]) ).
thf(10,plain,
( ( ( suc @ ( pl @ x @ y ) )
= ( pl @ x @ ( suc @ y ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[8]) ).
thf(11,plain,
! [SV2: nat,SV1: nat] :
( ( ( pl @ SV1 @ ( suc @ SV2 ) )
= ( suc @ ( pl @ SV1 @ SV2 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[9]) ).
thf(12,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[10,11]) ).
thf(13,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : NUM640^1 : TPTP v8.1.0. Released v3.7.0.
% 0.11/0.12 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.12/0.33 % Computer : n020.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jul 7 23:07:28 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34
% 0.12/0.34 No.of.Axioms: 1
% 0.12/0.34
% 0.12/0.34 Length.of.Defs: 0
% 0.12/0.34
% 0.12/0.34 Contains.Choice.Funs: false
% 0.12/0.34 (rf:0,axioms:1,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:3,loop_count:0,foatp_calls:0,translation:fof_full)
% 0.12/0.36 ********************************
% 0.12/0.36 * All subproblems solved! *
% 0.12/0.36 ********************************
% 0.12/0.36 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:1,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:12,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.12/0.36
% 0.12/0.36 %**** Beginning of derivation protocol ****
% 0.12/0.36 % SZS output start CNFRefutation
% See solution above
% 0.12/0.36
% 0.12/0.36 %**** End of derivation protocol ****
% 0.12/0.36 %**** no. of clauses in derivation: 13 ****
% 0.12/0.36 %**** clause counter: 12 ****
% 0.12/0.36
% 0.12/0.36 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:1,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:12,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------